Leader-following consensus of fractional-order multi-agent systems via adaptive control

This article focuses on the consensus problem of leader-following fractional-order multi-agent systems (MASs) with general linear and Lipschitz nonlinear dynamics. First, the distributed adaptive protocols for linear and nonlinear fractional-order MASs are constructed, respectively. We allow the control coupling gains to be time varying for each agent. Moreover, the adaptive modification schemes for the control gain are designed, which renders smaller control gains and thus requires smaller amplitude on the control input without sacrificing consensus convergence. Second, based on fractional-order Lyapunov stability theorem and Barbalat's lemma, two novel sufficient conditions in terms of linear matrix inequalities are provided to ensure that the leader-following consensus can be obtained in the case for any undirected connected communication graph. Furthermore, we show that the proposed algorithm also works for consensus of agents with intrinsic Lipschitz nonlinear dynamics. As a result, the proposed framework requires no global information and thus can be implemented in a fully distributed manner. Finally, the numerical simulations are given to demonstrate the effectiveness of obtained the theoretical results.     

具有光照鲁棒的图像匹配方法

针对现有的基于局部特征的图像匹配算法对光照变化敏感、匹配正确率低等问题，提出一种具有光照鲁棒性的图像匹配算法。首先使用实时对比保留去色（RTCP）算法灰度化图像，然后利用对比拉伸函数模拟不同光照变换对图像的影响从而提取抗光照变换特征点，最后采用局部强度顺序模式建立特征点描述符，根据待匹配图像局部特征点描述符的欧氏距离判断是否为成对匹配点。在公开数据集上，所提算法与尺度不变特征变换（SIFT）算法、加速鲁棒特征（SURF）算法、"风"（KAZE）算法和ORB算法在匹配速度和匹配正确率上进行了对比实验。实验结果表明：随着图像亮度差异的增加，SIFT算法、SURF算法、"风"（KAZE）算法和ORB算法匹配正确率下降迅速，所提算法下降缓慢并且正确率均高于80%；所提算法特征点检测较慢和描述符维数较高，平均耗时为23.47 s，匹配速度不及另外四种算法，但匹配质量却远超过它们。对实时性要求不高的系统中，所提算法可以克服光照变化对图像匹配造成的影响。     

国内建筑涂料市场影响因素与预测分析

中国是全球最大的建筑涂料市场，各涂料厂商在中国建筑涂料市场上进行激烈竞争，能够精准预测行业趋势对各涂料厂商精准决策和投资，提升企业经营质量具有重要意义。文章收集了近 12年建筑业总产值、房地产投资、城镇常住居民人口、 M2和 GDP等影响建筑涂料市场的数据，通过回归分析的方法得出：各影响因素与建筑涂料产量存在紧密且正相关的定量关系，并由此预测了国内建筑涂料市场在未来 3年将稳步发展。     

基于SARIMA-GRNN-SVM的短期商业电力负荷组合预测方法

针对短期商业电力负荷预测准确性与周期难以满足现有电力现货市场的问题,提出了一种基于SARIMAGRNN-SVM(seasonal autoregressive integrated moving average-generalized regression neural network-support vector machine)的商业电力负荷组合预测模型。首先,对商业电力负荷变化的周期规律与随机因素的复杂影响进行了分析;然后,结合以上分析,选用SARIMA和GRNN为单一预测模型对商业电力负荷进行预测,并利用SVM进行组合,实现日前商业电力负荷预测;最后,通过某商业综合体的电力负荷数据进行验证。所提组合预测模型较单一预测模型拥有更优的预测精度与鲁棒性,可以为短期商业电力负荷预测提供借鉴。     

Outlier accommodation in moving-horizon state estimation: A risk-averse performance-specified approach

This paper presents a novel state estimation approach for linear dynamic systems when measurements are corrupted by outliers. Since outliers can degrade the performance of state estimation, outlier accommodation is critical. The standard approach combines outlier detection utilizing Neyman-Pearson (NP) type tests with a Kalman filter (KF). This approach ignores all residuals greater than a designer-specified threshold. When measurements with outliers are used (ie, missed detections), both the state estimate and the error covariance matrix become corrupted. This corrupted state and covariance estimate are then the basis for all subsequent outlier decisions. When valid measurements are rejected (ie, false alarms), potentially using the corrupted state estimate and error covariance, measurement information is lost. Either using invalid information or discarding too much valid information can result in divergence of the KF. An alternative approach is moving-horizon (MH) state estimation, which maintains all recent measurement data within a moving window with a time horizon of length L. In MH approaches, the number of measurements available for state estimation is affected by both the number of measurements per time step and the number of time steps L over which measurements are retained. Risk-averse performance-specified (RAPS) state estimation works within an optimization setting to choose a set of measurements that achieves a performance specification with minimum risk of outlier inclusion. This paper derives and formulates the MH-RAPS solution for outlier accommodation. The paper also presents implementation results. The MH-RAPS application uses Global Navigation Satellite Systems measurements to estimate the state of a moving platform using a position, velocity, and acceleration model. In this application, MH-RAPS performance is compared with MH-NP state estimation.     

Comparison of fuzzy logic based models for the multi-response surface problems with replicated response measures

A replicated multi-response experiment is a process that includes more than one responses with replications. One of the main objectives in these experiments is to estimate the unknown relationship between responses and input variables simultaneously. In general, classical regression analysis is used for modeling of the responses. However, in most practical problems, the assumptions for regression analysis cannot be satisfied. In this case, alternative modeling methods such as fuzzy logic based modeling approaches can be used. In this study, fuzzy least squares regression (FLSR) and fuzzy clustering based modeling methods, which are switching fuzzy C-regression (SFCR) and Takagi–Sugeno (TS) fuzzy model, are preferred. The novelty of the study is presenting the applicability of SFCR to the multi-response experiment data set with replicated response measures. Three real data set examples are given for application purposes. In order to compare the prediction performance of modeling approaches, root mean square error (RMSE) criteria is used. It is seen from the results that the SFCR gives the better prediction performance among the other fuzzy modeling approaches for the replicated multi-response experimental data sets.     

Fix-and-relax approaches for controlled tabular adjustment

Controlled tabular adjustment (CTA) is a relatively new protection technique for tabular data protection. CTA formulates a mixed integer linear programming problem, which is challenging for tables of moderate size. Even finding a feasible initial solution may be a challenging task for large instances. On the other hand, end users of tabular data protection techniques give priority to fast executions and are thus satisfied in practice with suboptimal solutions. This work has two goals. First, the fix-and-relax (FR) strategy is applied to obtain good feasible initial solutions to large CTA instances. FR is based on partitioning the set of binary variables into clusters to selectively explore a smaller branch-and-cut tree. Secondly, the FR solution is used as a warm start for a block coordinate descent (BCD) heuristic (approach named FR+BCD); BCD was confirmed to be a good option for large CTA instances in an earlier paper by the second and third co-authors (Comput Oper Res 2011;38:1826–35 [23]). We report extensive computational results on a set of real-world and synthetic CTA instances. FR is shown to be competitive compared to CPLEX branch-and-cut in terms of quickly finding either a feasible solution or a good upper bound. FR+BCD improved the quality of FR solutions for approximately 25% and 50% of the synthetic and real-world instances, respectively. FR or FR+BCD provided similar or better solutions in less CPU time than CPLEX for 73% of the difficult real-world instances.     

Constructing General Orthogonal Fractional Factorial Split-Plot Designs

While the orthogonal design of split-plot fractional factorial experiments has received much attention already, there are still major voids in the literature. First, designs with one or more factors acting at more than two levels have not yet been considered. Second, published work on nonregular fractional factorial split-plot designs was either based only on Plackett–Burman designs, or on small nonregular designs with limited numbers of factors. In this article, we present a novel approach to designing general orthogonal fractional factorial split-plot designs. One key feature of our approach is that it can be used to construct two-level designs as well as designs involving one or more factors with more than two levels. Moreover, the approach can be used to create two-level designs that match or outperform alternative designs in the literature, and to create two-level designs that cannot be constructed using existing methodology. Our new approach involves the use of integer linear programming and mixed integer linear programming, and, for large design problems, it combines integer linear programming with variable neighborhood search. We demonstrate the usefulness of our approach by constructing two-level split-plot designs of 16–96 runs, an 81-run three-level split-plot design, and a 48-run mixed-level split-plot design. Supplementary materials for this article are available online.     

Liner services network design and fleet deployment with empty container repositioning

Transportation demand of shipping container fluctuates due to the seasonality of international trade, thus, every 3–6 months, the liner company has to alter its current liner shipping service network, redeploy ships and design cargo routes with the objective of minimizing the total cost. To solve the problem, the paper presents a mixed integer linear program model. The proposed model incorporates several relevant constraints, such as weekly frequency, the transshipment of cargo between two or more service routes, and transport time. Extensive numerical experiments based on realistic date of Asia–Europe–Oceania shipping operations show that the proposed model can solve real-case problems efficiently by CPLEX. The results demonstrate that the model can reduce ship’s capacity consumption and raise ships’ capacity utilization.